Maximizing the number of mixed packages subject to variety constraints

We develop a polynomial-time algorithm to optimise a variant of the one-dimensional bin-packing problem with side constraints. We also develop a pseudo-polynomial procedure to actually implement that optimal solution. The speci"c application is the allocation of excess of a population of various types of cards (e.g., left over from a previous selling season) to "xed-sized &&variety packs'' which guarantee a given level of variety (i.e., no more than k of any type of card). Some card types with large numbers (perhaps the most unpopular from the previous season) may have to be discarded to preserve the variety constraint. The method developed employs a test for feasibility of a given number of packs and includes a simple allocation procedure. A numerical example is provided along with (worst-case) complexity calculations. In addition, we solve a practical problem in which an organisation marketing Christmas cards sought to determine the impact of pack size and variety level on the level of unallocated cards.